Clustering performance comparison usingK-means and expectation maximization algorithms
نویسندگان
چکیده
منابع مشابه
Clustering performance comparison using K-means and expectation maximization algorithms
Clustering is an important means of data mining based on separating data categories by similar features. Unlike the classification algorithm, clustering belongs to the unsupervised type of algorithms. Two representatives of the clustering algorithms are the K-means and the expectation maximization (EM) algorithm. Linear regression analysis was extended to the category-type dependent variable, w...
متن کاملHybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
The present work proposes hybridization of Expectation-Maximization (EM) and KMeans techniques as an attempt to speed-up the clustering process. Though both K-Means and EM techniques look into different areas, K-means can be viewed as an approximate way to obtain maximum likelihood estimates for the means. Along with the proposed algorithm for hybridization, the present work also experiments wi...
متن کاملPerformance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project
In this article, we explore the theoretical aspects of the expectation maximization algorithm and how it can be applied to estimation of data as a Gaussian mixture model. We form comparisons and show how by the simplification of some parameters we can form the heuristic k-means algorithm. We then demonstrate through the authors’ code several situations where the EM-GMM algorithm performs signif...
متن کاملSome Studies of Expectation Maximization Clustering Algorithm to Enhance Performance
Expectation Maximization (EM) is an efficient mixture-model based clustering method. In this paper, authors made an attempt to scale-up the algorithm, by reducing the computation time required for computing quadratic term, without sacrificing the accuracy. Probability density function (pdf) is to be calculated in EM, which involves evaluating quadratic term calculation. Three recursive approach...
متن کاملThe Expectation-Maximization and Alternating Minimization Algorithms
The Expectation-Maximization (EM) algorithm is a hill-climbing approach to finding a local maximum of a likelihood function [7, 8]. The EM algorithm alternates between finding a greatest lower bound to the likelihood function (the “E Step”), and then maximizing this bound (the “M Step”). The EM algorithm belongs to a broader class of alternating minimization algorithms [6], which includes the A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biotechnology & Biotechnological Equipment
سال: 2014
ISSN: 1310-2818,1314-3530
DOI: 10.1080/13102818.2014.949045